Discrete quaternion Fourier transform in signal processing systems

Discrete Fourier Transform: Approach To Signal Processing

There are three different way to calculate DFT. First method is using formula of DFT or simultaneous equation. Second is Correlation technique and third one is using Fast Fourier Transform (FFT). First method is useful for understanding of basic idea of DFT, but it is not fit for practical and application purpose. In second method is based on detecting known waveform in another signal. It is us...

Fourier Transform – Signal Processing

2 - D Hexagonal Quaternion Fourier Transform in Color Image Processing

In this paper, we present a novel concept of the quaternion discrete Fourier transform on the two-dimensional hexagonal lattice, which we call the twodimensional hexagonal quaternion discrete Fourier transform (2-D HQDFT). The concept of the right-side 2D HQDFT is described and the left-side 2-D HQDFT is similarly con sidered. We analyze and present a new approach in processing the color images...

2-D Left-Side Quaternion Discrete Fourier Transform: Fast Algorithm

We describe a fast algorithm for the 2-D left-side QDFT which is based on the concept of the tensor representation when the color or four-componnrnt quaternion image is described by a set of 1-D quaternion signals and the 1-D left-side QDFTs over these signals determine values of the 2-D left-side QDFT at corresponding subset of frequency-points. The efficiency of the tensor algorithm for calcu...

Windowing Effects of Short Time Fourier Transform on Wideband Array Signal Processing Using Maximum Likelihood Estimation

During the last two decades, Maximum Likelihood estimation (ML) has been used to determine Direction Of Arrival (DOA) and signals propagated by the sources, using narrowband array signals. The algorithm fails in the case of wideband signals. As an attempt by the present study to overcome the problem, the array outputs are transformed into narrowband frequency bins, using short time Fourier tran...